f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
↳ QTRS
↳ DependencyPairsProof
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
D(s(x1)) → D(x1)
F(s(x1)) → F(x1)
F(s(x1)) → D(f(x1))
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
D(s(x1)) → D(x1)
F(s(x1)) → F(x1)
F(s(x1)) → D(f(x1))
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
D(s(x1)) → D(x1)
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
D(s(x1)) → D(x1)
The value of delta used in the strict ordering is 4.
POL(D(x1)) = (4)x_1
POL(s(x1)) = 1 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(s(x1)) → F(x1)
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(s(x1)) → F(x1)
The value of delta used in the strict ordering is 4.
POL(s(x1)) = 1 + (4)x_1
POL(F(x1)) = (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(0(x1)) → s(0(x1))
d(0(x1)) → 0(x1)
d(s(x1)) → s(s(d(x1)))
f(s(x1)) → d(f(x1))